- non-planarity
- onvlakheid
English-Dutch technical dictionary. 2013.
non-planarity
Look at other dictionaries:
Non-contact wafer testing — Wafer testing is a normal step in semiconductor device fabrication, used to detect defects in integrated circuits (IC) before they are assembled during the IC packaging step. Traditional (contact) wafer testing Probing ICs while they are still on … Wikipedia
Planarity testing — In graph theory, the planarity testing problem asks whether, given a graph, that graph is a planar graph (can be drawn in the plane without edge intersections). This is a well studied problem in computer science for which many practical… … Wikipedia
Jordan curve theorem — Illustration of the Jordan curve theorem. The Jordan curve (drawn in black) divides the plane into an inside region (light blue) and an outside region (pink). In topology, a Jordan curve is a non self intersecting continuous loop in the plane.… … Wikipedia
Maximally stable extremal regions — Feature detection Output of a typical corner detection algorithm … Wikipedia
Gopalasamudram Narayana Iyer Ramachandran — (8 October, 1922 7 April, 2001) is widely acknowledged as one of the most important Indian scientists of the 20th century, best known for his work that led to his creation of the Ramachandran plot for understanding peptide structure. He also made … Wikipedia
Asymmetric synthesis — Asymmetric synthesis, also called chiral synthesis, enantioselective synthesis or stereoselective synthesis, is organic synthesis which introduces one or more new and desired elements of chirality. [GoldBookRef|title=asymmetric synthesis| file =… … Wikipedia
Enantioselective synthesis — Enantioselective synthesis: Sharpless epoxidation Enantioselective synthesis, also called chiral synthesis, asymmetric synthesis or stereoselective synthesis, is organic synthesis that introduces one or more new and desired elements of… … Wikipedia
Planar graph — Example graphs Planar Nonplanar Butterfly graph K5 The complete graph K4 … Wikipedia
Théorème de Robertson-Seymour — En mathématiques, et plus précisément en théorie des graphes, le théorème de Robertson–Seymour (parfois également appelé le théorème des mineurs, et connu, avant qu il soit démontré, sous le nom de conjecture de Wagner), est un théorème démontré… … Wikipédia en Français
PQ tree — A PQ tree is a tree based data structure that represents a family of permutations on a set of elements, discovered and named by Kellogg S. Booth and George S. Lueker in 1976. It is a rooted, labeled tree, in which each element is represented by… … Wikipedia
Depth-first search — Order in which the nodes are visited Class Search algorithm Data structure Graph Worst case performance … Wikipedia
